A Hyper-Heuristic Inspired by Pearl Hunting
نویسندگان
چکیده
Pearl hunting is a traditional way of diving to retrieve pearl from pearl oysters or to hunt some other sea creatures. In some areas, hunters need to dive and search seafloor repeatedly at several meters depth for pearl oysters. In a search perspective, pearl hunting consists of repeated diversification (to surface and change target area) and intensification (to dive and find pearl oysters). A Pearl Hunter (PHunter) hyper-heuristic is inspired by the pearl hunting, as shown in Fig. 1. Given a problem domain and some low-level heuristics (LLHs), PHunter can group, test, select and organize LLHs for the domain by imitating a rational diver.
منابع مشابه
A novel meta-heuristic optimization algorithm inspired by group hunting of animals: Hunting search
A novel optimization algorithm is presented, inspired by group hunting of animals such as lions, wolves, and dolphins. Although these hunters have differences in theway of hunting, they are common in that all of them look for a prey in a group. The hunters encircle the prey and gradually tighten the ring of siege until they catch the prey. In addition, eachmember of the group corrects its posit...
متن کاملHybrid Improved Dolphin Echolocation and Ant Colony Optimization for Optimal Discrete Sizing of Truss Structures
This paper presents a robust hybrid improved dolphin echolocation and ant colony optimization algorithm (IDEACO) for optimization of truss structures with discrete sizing variables. The dolphin echolocation (DE) is inspired by the navigation and hunting behavior of dolphins. An improved version of dolphin echolocation (IDE), as the main engine, is proposed and uses the positive attributes of an...
متن کاملAn Ant-Based Selection Hyper-heuristic for Dynamic Environments
Dynamic environment problems require adaptive solution methodologies which can deal with the changes in the environment during the solution process for a given problem. A selection hyper-heuristic manages a set of low level heuristics (operators) and decides which one to apply at each iterative step. Recent studies show that selection hyperheuristic methodologies are indeed suitable for solving...
متن کاملCross-domain Heuristic Search Challenge: GISS Algorithm presentation
Generic Iterative Simulated-Annealing Search (GISS) is a hyper-heuristic algorithm inspired on a Simulated Annealing driven method, on this context its used to explore across the different instance-heuristicstate search space. On this extended abstract we describe the proposed approach, characteristics and others technicals parameters.
متن کاملPearl Hunter: A Hyper-heuristic that Compiles Iterated Local Search Algorithms
Searching for best configurations to achieve some goal is a fundamental trait of intelligence and can be found in many ancient stories, such as the Carthaginian bullhide rope in 800s B.C. and Sun’s strategy of rearranging of best, average and inferior horses to race against king’s in 340s B.C. in ancient China[1]. In the contemporary world, almost all branches of engineering have been highly de...
متن کامل